Ramsey transfer to semi-retractions
نویسندگان
چکیده
منابع مشابه
Semi-algebraic Ramsey Numbers
Given a finite point set P ⊂ R, a k-ary semi-algebraic relation E on P is the set of k-tuples of points in P , which is determined by a finite number of polynomial equations and inequalities in kd real variables. The description complexity of such a relation is at most t if the number of polynomials and their degrees are all bounded by t. The Ramsey number R k (s, n) is the minimum N such that ...
متن کاملRetractions to Pseudoforests
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops allowed) where each connected component has at most one cycle, i.e., a pseudoforest. In particular, this result extends the known complexity classifications of Ret(H) for reflexive and irreflexive cycles to general cyc...
متن کاملList homomorphisms and retractions to reflexive digraphs
We study the list homomorphism and retraction problems for the class of reflexive digraphs (digraphs in which each vertex has a loop). These problems have been intensively studied in the case of undirected graphs, but the situation seems more complex for digraphs. We also focus on an intermediate ‘subretraction’ problem. It turns out that the complexity of the subretraction problem can be class...
متن کاملProjections and Retractions
The main result of this paper is a generalization of a theorem of R. S. Phillips [6] on the nonexistence of projections of l°° onto c0. If S is a locally compact Hausdorff space then let C(S) denote the space of bounded continuous real (or complex) valued functions on 5; also, let Co(S) be those functions in C(S) which vanish at infinity. If N is the space of positive integers with the discrete...
متن کاملAre more retractions due to more scrutiny ?
© Brembs This article is distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and redistribution in any medium, provided that the original author and source are credited. In the last “Science Weekly” podcast from the Guardian, the topic was retractions. At about 20:29 into the episode, Hannah Devlin asked, wheth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2021
ISSN: 0168-0072
DOI: 10.1016/j.apal.2020.102891